See Flajolet-Martin algorithm in All languages combined, or Wiktionary
{
"etymology_text": "Introduced by Philippe Flajolet and G. Nigel Martin in their 1984 article \"Probabilistic Counting Algorithms for Data Base Applications\".",
"head_templates": [
{
"args": {},
"expansion": "Flajolet-Martin algorithm",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"An algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption."
],
"id": "en-Flajolet-Martin_algorithm-en-name-caTxDE9D",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"approximating",
"approximate"
],
[
"distinct",
"distinct"
],
[
"element",
"element"
],
[
"stream",
"stream"
],
[
"pass",
"pass"
],
[
"logarithmic",
"logarithmic"
]
],
"raw_glosses": [
"(computing theory) An algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Flajolet-Martin algorithm"
]
}
],
"word": "Flajolet-Martin algorithm"
}
{
"etymology_text": "Introduced by Philippe Flajolet and G. Nigel Martin in their 1984 article \"Probabilistic Counting Algorithms for Data Base Applications\".",
"head_templates": [
{
"args": {},
"expansion": "Flajolet-Martin algorithm",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"An algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"approximating",
"approximate"
],
[
"distinct",
"distinct"
],
[
"element",
"element"
],
[
"stream",
"stream"
],
[
"pass",
"pass"
],
[
"logarithmic",
"logarithmic"
]
],
"raw_glosses": [
"(computing theory) An algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Flajolet-Martin algorithm"
]
}
],
"word": "Flajolet-Martin algorithm"
}
Download raw JSONL data for Flajolet-Martin algorithm meaning in English (1.3kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-11-28 from the enwiktionary dump dated 2024-11-21 using wiktextract (65a6e81 and 0dbea76). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.